Learning to Identify Global Bottlenecks in Constraint Satisfaction Search
نویسندگان
چکیده
Using information from failures to guide subsequent search is an important technique for solving combinatorial problems in domains such as boolean satisfiability (SAT) and constraint satisfaction problems (CSPs). The information learnt can take various forms such as fine-grained information in the form of no-goods and explanations in CSPs and clause learning in SAT, or coarse-grained information in the form of constraint weighting in CSPs and clause weighting in SAT. In this paper we focus on CSPs, using constraint weighting with restarts in order to identify global bottlenecks in a problem. This information is then used by a “weighted-degree” heuristic to guide complete search, with the belief that instantiating these elements first will reduce the overall search effort required to either find a solution or prove the problem
منابع مشابه
A New Approach to Constraint Weight Learning for Variable Ordering in CSPs
A Constraint Satisfaction Problem (CSP) is a framework used for modeling and solving constrained problems. Treesearch algorithms like backtracking try to construct a solution to a CSP by selecting the variables of the problem one after another. The order in which these algorithm select the variables potentially have significant impact on the search performance. Various heuristics have been prop...
متن کاملLearning from Failure in Constraint Satisfaction Search
Much work has been done on learning from failure in search to boost solving of combinatorial problems, such as clause-learning in boolean satisfiability (SAT), nogood and explanation-based learning, and constraint weighting in constraint satisfaction problems (CSPs), etc. Many of the top solvers in SAT use clause learning to good effect. A similar approach (nogood learning) has not had as large...
متن کاملProblem-Structure vs. Solution-Based Methods for Solving Dynamic Constraint Satisfaction Problems
A new type of reasoning-reuse technique for dynamic constraint satisfaction problems (DCSPs) is based on a form of the weighted degree strategy known as random probing, in which failures are sampled prior to search. This approach is effective with DCSPs because it can locate major bottlenecks in a problem, and because bottlenecks tend to remain stable after small or moderate changes. Here, we s...
متن کاملState space search nogood learning: Online refinement of critical-path dead-end detectors in planning
Conflict-directed learning is ubiquitous in constraint satisfaction problems like SAT, but has been elusive for state space search on reachability problems like classical planning. Almost all existing approaches learn nogoods relative to a fixed solution-length bound, in which case planning/reachability reduces to a constraint satisfaction problem. Here we introduce an approach to learning more...
متن کاملA Study of Adaptive Restarting Strategies for Solving Constraint Satisfaction Problems
In this paper we present a study of four generic strategies for solving constraint satisfaction problems (CSPs) of any kind, be they soluble or insoluble. All four methods combine learning with restarting, two use a fixed cutoff restarting strategy followed by a run to completion, the other two use universal restarting strategies where the cutoff varies from run to run. Learning takes the form ...
متن کامل